Papers with indexing costs
SCVQ: Sparse-Compensated Vector Quantization for Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing vector quantization methods incur inference overhead due to massive codebook storage and intensive index lookups. |
| Approach: | They propose a framework for vector quantization that incorporates a salience-aware weighted K-means clustering scheme with symmetry constraints to reduce codebook size and indexing costs. |
| Outcome: | The proposed framework achieves a perplexity of 5.78 on WikiText-2 for LLaMA-2-7B at 2-bit quantization while delivering a 1.4 speedup over existing baselines. |
EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing lightweight approaches to retrieval-augmented generation fail to capture latent semantic connections between disjoint entities. |
| Approach: | They propose a lightweight RAG framework that constructs a hypergraph capturing both structure and semantic relationships using a hybrid structural-semantic retrieval mechanism. |
| Outcome: | EHRAG outperforms state-of-the-art methods on four datasets while maintaining zero token consumption. |